An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
نویسندگان
چکیده
منابع مشابه
Motion Planning for a Convex Polygon in a Polygonal Environment
We study the motion-planning problem for a convex m-gon P in a planar polygonal environment Q bounded by n edges. We give the rst algorithm that constructs the entire free connguration space (the 3-dimensional space of all free placements of P in Q) in time that is near-quadratic in mn, which is nearly optimal in the worst case. The algorithm is also conceptually relatively simple. Previous sol...
متن کاملOn the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space
Given a convex polygonal robot B with k edges capable of translation and rotation, and a set of polygonal obstacles {A1, . . . , Am} each with ni sides and n = ∑ m i=1 ni, Leven and Sharir [1] prove that the number of critical placements of B at which it makes 3 simultaneous contacts with the obstacles but does not intersect their interior is O(knλ6(kn)), where λs(u) is the maximum length of a ...
متن کاملSpace-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
We present space-efficient algorithms for computing the convex hull of a simple polygonal line in-place, in linear time. It turns out that the problem is as hard as in-place stable partition, i.e., if there were a truly simple solution then in-place stable partition would also have a truly simple solution, and vice versa. Nevertheless, we present a simple self-contained solution that uses O(log...
متن کاملMotion planning for disc-shaped robots pushing a polygonal object in the plane
This paper addresses the problem of using three disc-shaped robots to manipulate a polygonal object in the plane in the presence of obstacles. The proposed approach is based on the computation of maximal discs (dubbed maximum independent capture discs, or MICaDs) where the robots can move independently while preventing the object from escaping their grasp. It is shown that, in the absence of ob...
متن کاملA Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment
We consider the problem of planning the motion of an arbitrary k-sided polygonal robot B, free to translate and rotate in a polygonal environment V bounded by n edges. We present an algorithm that constructs a single component of the free connguration space of B in time O((kn) 2+"), for any " > 0. This algorithm, combined with some standard techniques in motion planning, yields a solution to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1990
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02187779